Fast Monte Carlo Estimation of Timing Yield: Importance Sampling with Stochastic Logical Effort (ISLE)

نویسندگان

  • Alp Arslan Bayrakci
  • Alper Demir
  • Serdar Tasiran
چکیده

In the nano era in integrated circuit fabrication technologies, the performance variability due to statistical process and circuit parameter variations is becoming more and more significant. Considerable effort has been expended in the EDA community during the past several years in trying to cope with the so-called statistical timing problem. Most of this effort has been aimed at generalizing the static timing analyzers to the statistical case. In this paper, we take a pragmatic approach in pursuit of making the Monte Carlo method for timing yield estimation practically feasible. The Monte Carlo method is widely used as a golden reference in assessing the accuracy of other timing yield estimation techniques. However, it is generally believed that it can not be used in practice for estimating timing yield as it requires too many costly full circuit simulations for acceptable accuracy. In this paper, we present a novel approach to constructing an improved Monte Carlo estimator for timing yield which provides the same accuracy as the standard Monte Carlo estimator, but at a cost of much fewer full circuit simulations. This improved estimator is based on a novel combination of a variance reduction technique, importance sampling, and a stochastic generalization of the logical effort formalism for cheap but approximate delay estimation. The results we present demonstrate that our improved yield estimator achieves the same accuracy as the standard Monte Carlo estimator at a cost reduction reaching several orders of magnitude. Keywords— logical effort, statistical variations, timing yield estimation and optimization, statistical timing analysis, Monte Carlo methods, variance reduction techniques, importance sampling.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Logical Effort and Smart Monte Carlo for Timing Yield Estimation and Optimization

This paper presents novel techniques for timing yield optimization and for yield estimation in the presence of large statistical process variations in integrated circuits. The techniques are based on our generalization of the logical effort delay model to circuits with stochastic parameter variations. In the spirit of the standard logical effort formalism, the stochastic gate delay model we pro...

متن کامل

Stochastic logical effort as a variation aware delay model to estimate timing yield

Considerable effort has been expended in the EDA community during the past decade in trying to cope with the so-called statistical timing problem. In this paper, we not only present a fast and approximate gate delay model called stochastic logical effort (SLE) to capture the effect of statistical parameter variations on the delay but also combine this model with a previously proposed transistor...

متن کامل

Smart Monte Carlo for Yield Estimation

We propose techniques for accurate and computationally viable estimation of timing yield using circuit-level Monte Carlo simulation. Our techniques are based on well-known variance reduction approaches from Monte Carlo simulation literature. By adapting these techniques to the yield estimation problem, one can reduce the number of Monte Carlo samples required in order to estimate yield within a...

متن کامل

Option pricing under the double stochastic volatility with double jump model

In this paper, we deal with the pricing of power options when the dynamics of the risky underling asset follows the double stochastic volatility with double jump model. We prove efficiency of our considered model by fast Fourier transform method, Monte Carlo simulation and numerical results using power call options i.e. Monte Carlo simulation and numerical results show that the fast Fourier tra...

متن کامل

Adaptive Sample Size and Importance Sampling in Estimation-based Local Search for Stochastic Combinatorial Optimization: A complete analysis

Metaheuristics and local search algorithms have received considerable attention as promising methods for tackling stochastic combinatorial optimization problems. However, in stochastic settings, these algorithms are usually simple extensions of the versions that are originally designed for deterministic optimization and often they lack rigorous integration with techniques that handle the stocha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0805.2627  شماره 

صفحات  -

تاریخ انتشار 2007